Dyck paths and pattern-avoiding matchings

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pattern - avoiding Dyck paths †

We introduce the notion of pattern in the context of lattice paths, and investigate it in the specific case of Dyck paths. Similarly to the case of permutations, the pattern-containment relation defines a poset structure on the set of all Dyck paths, which we call the Dyck pattern poset. Given a Dyck path P , we determine a formula for the number of Dyck paths covered by P , as well as for the ...

متن کامل

Matchings Avoiding Partial Patterns and Lattice Paths

In this paper, we consider matchings avoiding partial patterns 1123 and 1132. We give a bijection between 1123-avoiding matchings with n edges and nonnegative lattice paths from (0, 2) to (2n, 0). As a consequence, the refined enumeration of 1123-avoiding matchings can be reduced to the enumeration of certain lattice paths. Another result of this paper is a bijection between 1132-avoiding match...

متن کامل

On Bijections between 231-avoiding Permutations and Dyck Paths

We construct a bijection between 231-avoiding permutations and Dyck paths that sends the sum of the major index and the inverse major index of a 231avoiding permutation to the major index of the corresponding Dyck path. Furthermore, we relate this bijection to others and exhibit a bistatistic on 231-avoiding permutations which is related to the q, t-Catalan numbers.

متن کامل

Dyck Paths with Peak- and Valley-Avoiding Sets

In this paper, we focus on Dyck paths with peaks and valleys, avoiding an arbitrary set of heights. The generating functions of such types of Dyck paths can be represented by continued fractions. We also discuss a special case that requires all peak and valley heights to avoid congruence classes modulo k. We study the shift equivalence on sequences, which in turn induces an equivalence relation...

متن کامل

Bijections from Dyck paths to 321-avoiding permutations revisited

There are at least three di erent bijections in the literature from Dyck paths to 321-avoiding permutations, due to Billey-Jockusch-Stanley, Krattenthaler, and Mansour-Deng-Du. How di erent are they? Denoting them B;K;M respectively, we show that M = B Æ L = K Æ L where L is the classical Kreweras-Lalanne involution on Dyck paths and L0, also an involution, is a sort of derivative of L. Thus K ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Combinatorics

سال: 2007

ISSN: 0195-6698

DOI: 10.1016/j.ejc.2005.07.013